Myopic sparse image reconstruction with application to MRFM

We propose a solution to the image deconvolution problem where the convolution operator or point spread function (PSF) is assumed to be only partially known. Small perturbations generated from the model are exploited to produce a few principal components explaining the uncertainty in a high dimensional space. Specifically, we assume the image is sparse corresponding to the natural sparsity of magnetic resonance force microscopy (MRFM). Our approach adopts a Bayesian Metropolis-within-Gibbs sampling framework. The performance of our Bayesian myopic algorithm is superior to previously proposed algorithms such as the alternating minimization (AM) algorithm for sparse images. We illustrate our myopic algorithm on real MRFM tobacco virus data.